this paper concerns the transmission of two independent gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous csis. the availability of the channel state information at receivers (csir) is considered in two scenarios of perfect and imperfect csir. in the imperfect csir case, we consider a more practical assumption of...

269 Abslruct-The successive refinement of information consists of first approximating data using a few hits of information, then iteratively improving the approximation as more and more information is supplied. The goal is to achieve an optimal description at each stage. In general an ongoing description is sought which is rate-distortion optimal whenever it is interrupted. It is shown that a r...

Rate-distortion bounds for scalable coding, and conditions under which they coincide with nonscalable bounds, have been extensively studied. These bounds have been derived for the general tree-structured refinement scheme, where reproduction at each layer is an arbitrarily complex function of all encoding indexes up to that layer. However, inmost practical applications (e.g., speech coding) “ad...

In successive refinement of information, the decoder refines its representation of the source progressively as it receives more encoded bits. The rate-distortion region of successive refinement describes the minimum rates required to attain the target distortions at each decoding stage. In this paper, we derive a parametric characterization of the rate-distortion region for successive refinemen...

Successive refinement is a technique to encode a source iteratively, improving the distortion at each step. If the code rates of all steps combined can be as efficient as coding only for the final distortion in one go, then the source is said to be successively refinable. We turn our attention to vector sources and we propose to replace the high-distortion first stage by a projection to low-dim...

We show how the event-based notation offered by Event-B may be augmented by algorithmic modelling constructs without disrupting the refinement-based development process.

An approach for automatic control using on-line learning is presented. The controller’s model for the system represents the effects of control actions in v,’u’ious (hyperspherical) regions of state space. The partition produced by these regions is initially coarse, limiting optimization of the corresponding control actions. Regions contract periodically to enable optimization to progress furthe...